On Non Inclusive Distance Vertex Irregularity Strength of Tadpole and Path Corona Path Graphs
نویسندگان
چکیده
منابع مشابه
Total vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملtotal vertex irregularity strength of corona product of some graphs
a vertex irregular total k-labeling of a graph g with vertex set v and edge set e is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. the total vertex irregularity strength of g, denoted by tvs(g)is the minimum value of the largest label k over all such irregular assignment. in this paper, we study the to...
متن کاملOn total vertex irregularity strength of graphs
Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths of graphs. In this paper we discuss how the addition of new edge affect the total vertex irregularity strength.
متن کاملVertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملTotal Vertex Irregularity Strength of Circular Ladder and Windmill Graphs
Let ( , ) G V E be a simple graph. For a total labeling { } : 1,2,3,..., V E k ∂ ∪ → the weight of a vertex x is defined as ( ) ( ) ( ). xy E wt x x xy ∈ = ∂ + ∂ ∑ ∂ is called a vertex irregular total k-labeling if for every pair of distinct vertices x and y, ( ) ( ). wt x wt y ≠ . The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics and Mathematics Education
سال: 2020
ISSN: 2715-8276,2089-8878
DOI: 10.20961/jmme.v10i1.42405